Domain Range Semigroups and Finite Representations
نویسندگان
چکیده
Relational semigroups with domain and range are a useful tool for modelling nondeterministic programs. We prove that the representation class of domain-range demonic composition is not finitely axiomatisable. extend result ordered algebras show any relation algebra reduct signature containing domain, range, converse, composition, but no negation, meet, nor join has finite property. That representable structure such over base. survey results in area
منابع مشابه
compactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولIrreducible Matrix Representations of Finite Semigroups
Munn [9] has shown that for a semigroup S satisfying the minimal condition on principal ideals, there is a natural one-to-one correspondence between irreducible representations of S and irreducible representations vanishing at zero of its 0-simple (or simple) principal factors; for the case of S finite, see Ponizovskii [11]. On the other hand, Clifford, [3] and [4], has obtained all representat...
متن کاملDomain and Antidomain Semigroups
We axiomatise and study operations for relational domain and antidomain on semigroups and monoids. We relate this approach with previous axiomatisations for semirings, partial transformation semigroups and dynamic predicate logic.
متن کاملFinite semigroups as categories, ordered semigroups or compact semigroups
The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88701-8_29